Derandomization via complexity theory

Noam Nisan constructed pseudo random number generators which convert O(S log R) truly random bits to R bits that appear random to any algorithm that runs in SPACE(S). D Sivakumar, demonstrated that a large class of probabilistic algorithms can be derandomized using Nisan’s construction. This class of algorithms is characterized by the fact that each probabilistic algorithm can thought of as a set of log space bounded tests being performed on random bit strings drawn from a uniform distribution. A detailed description of the method and this class of algorithms is presented.